discrete log problem

discrete log problem
задача дискретного логарифмирования

Англо-русский словарь по компьютерной безопасности. . 2011.

Игры ⚽ Поможем написать реферат

Смотреть что такое "discrete log problem" в других словарях:

  • Log-lineare Modelle — gehören zu den multivariaten Verfahren. Mit Log linearen Modellen werden nominalskalierte Daten analysiert. Durch eine logarithmische Transformation kann man bei der Analyse mehrdimensionaler Häufigkeitstabellen das Problem meist anschaulicher… …   Deutsch Wikipedia

  • Log-lineares Modell — Log lineare Modelle gehören zu den multivariaten Verfahren. Mit Log linearen Modellen werden nominalskalierte Daten analysiert. Durch eine logarithmische Transformation kann man bei der Analyse mehrdimensionaler Häufigkeitstabellen das Problem… …   Deutsch Wikipedia

  • Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

  • Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …   Wikipedia

  • Discrete sine transform — In mathematics, the discrete sine transform (DST) is a Fourier related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length,… …   Wikipedia

  • Problem der Museumswächter — Das Problem der Museumswächter (en: Art gallery problem) ist eine Fragestellung der Algorithmischen Geometrie. Dabei wird folgende Situation untersucht: „Gegeben sei eine polygonale Fläche G mit Rand , interpretiert als Grundriss eines Museums.… …   Deutsch Wikipedia

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • Diffie-Hellman problem — The Diffie Hellman problem (DHP) is the name of a specific problem in cryptography which was first proposed by Whitfield Diffie and Martin Hellman. The DHP is a problem that is assumed to be difficult to do, hence the security of many… …   Wikipedia

  • Diffie–Hellman problem — Cryptography portal The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical… …   Wikipedia

  • Uniform distribution (discrete) — discrete uniform Probability mass function n = 5 where n = b − a + 1 Cumulative distribution function …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»